Almost Repdigit k-Fibonacci Numbers with an Application of k-Generalized Fibonacci Sequences

نویسندگان

چکیده

In this paper, we define the notion of almost repdigit as a positive integer whose digits are all equal except for at most one digit, and search terms k-generalized Fibonacci sequence which repdigits. particular, find numbers powers 10 special case second part by using roots characteristic polynomial sequence, introduce tiny golden angles show feasibility new type in application to magnetic resonance imaging.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized (k, r)–Fibonacci Numbers

In this paper, and from the definition of a distance between numbers by a recurrence relation, new kinds of k–Fibonacci numbers are obtained. But these sequences differ among themselves not only by the value of the natural number k but also according to the value of a new parameter r involved in the definition of this distance. Finally, various properties of these numbers are studied.

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

Restricted Permutations Related to Fibonacci Numbers and k-Generalized Fibonacci Numbers

A permutation π ∈ Sn is said to avoid a permutation σ ∈ Sk whenever π contains no subsequence with all of the same pairwise comparisons as σ. In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 123, 132, and 213 is the Fibonacci number Fn+1. In this paper we generalize this result in two ways. We first show that the number of permutations which avoid 132, 213, an...

متن کامل

A Simplified Binet Formula for k-Generalized Fibonacci Numbers

In this paper, we present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc.). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula in order to generate the desired sequence.

متن کامل

On The Usual Fibonacci and Generalized Order-k Pell Numbers

In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We …nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11020455